搜索资源列表
Branch and Bound
- Branch and Bound 算法实现.用以快速搜索一个区域.-Branch and Bound algorithm. Quick search for a regional.
TSP_BranchAndBound.rar
- Solving the TSP problem using the Branch and Bound Algorithm,Solving the TSP problem using the Branch and Bound Algorithm
BNB20.rar
- branch-and-bound-tree algotihm for optimization,branch-and-bound-tree algotihm for optimization
BABA.rar
- TSP问题的求解，分支限界，利用分支限界求TSP问题,TSP Soulution using branch and bound
fzdj.rar
- 分支定界算法C语言实现源程序,标准C源代码，直接可以运行，程序有详细的说明,Branch and bound algorithm for C language source code implementation, the standard C source code can run directly, the program has a detailed descr iption of
IntProgFZ.rar
- 利用分支定界法求解整数规划问题，结果精确~~~~~,Using branch and bound method to solve integer programming problems, the results of precise ~~~~~
branch-and-cut-algorithm.rar
- 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。 ,Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is
branch_and_board
- 在模式识别应用中，用分支定界法(branch-and-board method)进行特征的选择。该程序在matlab环境下实现了该算法，以从六个特征中选择两个最佳特征为例-In pattern recognition applications, using branch and bound method (branch-and-board method) to carry out the characteristics of choice. The program in the matlab e
Knapsack
- 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
FlowShop
- 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data us
BranchBound
- 算法作业，采用分支定界算法，求解最小路径问题-Algorithm operations, branch and bound algorithm for solving the minimum path problem
TSP
- 本程序通过使用分支限界法实现旅行商问题，成功解决了旅行商问题-This procedure achieved by using the branch and bound traveling salesman problem, successfully solved the traveling salesman problem
bnb20
- 在实际应用着经常需要求解非线性整数规划或混合规划问题，该领域中的一种常用的算法是分支定界(branch and bound)算法，但是matlab工具箱中没有相关的函数。荷兰Groningen大学的Koert Kuipers编写的的BNB20工具箱可以用来求解一般非线性整数规划问题-In practice, frequent need to solve nonlinear integer programming or mixed programming problem, the area a p
suanfashejiyufenxi
- 计算机算法设计与分析实验报告:6大算法详细实验报告(相当详细).分治,动态规划,贪心,回溯,分支限界-Computer Algorithm Design and Analysis of Experimental Report: 6 large algorithm experiment detailed report (in considerable detail). Sub-rule, dynamic programming, greedy, backtracking, branch and b
fenzhi
- 通过分支限界的方法，求解1到n的最短路径。设数组a保存图的邻接矩阵，0-9号，共10个节点。节点1为源点，n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 is the source, n for the target
shortestpaths
- 一个不错的源码，关于分支限界求单源最短路径,java，推荐给大家共享，希望能相互学习-A good source, on the branch and bound for single-source shortest path, java, recommend to all to share, hoping to learn from each other
SimpMethodProj
- [数学问题]用分支定界发解线性混合整数规划问题，JavaSE swing 界面。-[Mathematical problem] Used branch and bound solution fat LMIP problem, JavaSE swing GUI.
45665972BoundAndBranch
- Algoritm branch and bound and shortest path in C
bnb20
- 非线性整数规划算法，求解非线性整数规划活混合规划问题，常用的算法是分枝定界算法。基于该算法编成的现成函数bnb20()-Nonlinear integer programming algorithm for solving nonlinear mixed integer programming live planning problem, commonly used algorithms are branch-and-bound algorithm. Based on the algorithm